Uniqueness results for minimal enclosing ellipsoids
نویسنده
چکیده
We prove uniqueness of the minimal enclosing ellipsoid with respect to strictly eigenvalue convex size functions. Special examples include the classic case of minimal volume ellipsoids (Löwner ellipsoids), minimal surface area ellipsoids or, more generally, ellipsoids that are minimal with respect to quermass integrals.
منابع مشابه
Davis’ Convexity Theorem and Extremal Ellipsoids
We give a variety of uniqueness results for minimal ellipsoids circumscribing and maximal ellipsoids inscribed into a convex body. Uniqueness follows from a convexity or concavity criterion on the function used to measure the size of the ellipsoid. Simple examples with non-unique minimal or maximal ellipsoids conclude this article. MSC 2000: 52A27, 52A20
متن کاملSmallest Enclosing Disks (balls and Ellipsoids)
A simple randomized algorithm is developed which computes the smallest enclosing disk of a nite set of points in the plane in expected linear time. The algorithm is based on Seidel's recent Linear Programming algorithm, and it can be generalized to computing smallest enclosing balls or ellipsoids of point sets in higher dimensions in a straightforward way. Experimental results of an implementat...
متن کاملMinimum Volume Enclosing Ellipsoids
Two different methods for computing the covering ellipses of a set of points are presented. The first method finds the optimal ellipsoids with the minimum volume. The second method uses the first and second moments of the data points to compute the parameters of an ellipsoid that covers most of the points. A MATLAB software is written to verify the results.
متن کاملApproximate Minimum Volume Enclosing Ellipsoids Using Core Sets
We study the problem of computing the minimum volume enclosing ellipsoid containing a given point set S = {p1, p2, . . . , pn} ⊆ R. Using “core sets” and a column generation approach, we develop a (1 + )-approximation algorithm. We prove the existence of a core set X ⊆ S of size at most |X| = α = O ( d ( log d + 1 )) . We describe an algorithm that computes the set X and a (1 + )-approximation ...
متن کاملComputing Minimum-Volume Enclosing Axis-Aligned Ellipsoids
Given a set of points S = {x1, . . . , xm} ⊂ R and > 0, we propose and analyze an algorithm for the problem of computing a (1 + )-approximation to the minimum-volume axis-aligned ellipsoid enclosing S . We establish that our algorithm is polynomial for fixed . In addition, the algorithm returns a small core set X ⊆ S , whose size is independent of the number of points m, with the property that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 25 شماره
صفحات -
تاریخ انتشار 2008